Multiple-degree dynamics

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamics of a Two Degree of Freedom Vibro-Impact System with Multiple Motion Limiting Constraints

We consider the dynamics of impact oscillators with multiple degrees of freedom subject to more than one motion limiting constraint or stop. A mathematical formulation for modelling such systems is developed using a modal approach including a modal form of the coefficient of restitution rule. The possible impact configurations for an N degree of freedom system are considered, along with definit...

متن کامل

Dynamics of the Degree Six Landen Transformation

We establish the basin of attraction for the fixed point (3, 3) of a dynamical system arising from the evaluation of a definite integral.

متن کامل

Evolutionary dynamics on degree-heterogeneous graphs.

The evolution of two species with different fitness is investigated on degree-heterogeneous graphs. The population evolves either by one individual dying and being replaced by the offspring of a random neighbor (voter model dynamics) or by an individual giving birth to an offspring that takes over a random neighbor node (invasion process dynamics). The fixation probability for one species to ta...

متن کامل

Multiple Degree Reduction of Interval DP Curves

O. Ismail, Senior Member, IEEE Abstract— Fixed DP curve is a recent representation of the polynomial curves, proposed by Delgado and Pena in 2003. They introduced a new curve representation with linear computational complexity. An algorithmic approach to degree reduction of interval DP curve is presented in this paper. The four fixed Kharitonov's polynomials (four fixed DP curves) associated wi...

متن کامل

Factors with Multiple Degree Constraints in Graphs

For a graph G and for each vertex v ∈ V (G), let ΛG(v) = {EG(v, 1), EG(v, 2), . . . , EG(v, kv)} be a partition of the edges incident with v. Let ΛG = {ΛG(v) ∣∣ v ∈ V (G)}. We call the pair (G,ΛG) a partitioned graph. Let k = maxv kv and let g, f : V (G)×{1, . . . , k} → N and t, u : V (G)→ N be functions where for all vertices v ∈ V (G) (i) g(v, i) ≤ f(v, i) ≤ dG(v, i) i = 1, . . . , kv (ii) u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 2000

ISSN: 0028-0836,1476-4687

DOI: 10.1038/35007264